A Paraconsistent Semantics with Contradiction Support Detection

نویسندگان

  • Carlos Viegas Damásio
  • Luís Moniz Pereira
چکیده

We begin by motivating the use of paraconsistency and the detection of contradiction supported conclusions by recourse to examples. Next we overview WFSX p and present its embedding into WFS. We then address the problem of detecting contradiction support and relate it to WFSX p's intrinsic properties. Afterwards, we show how to implement two recent modal contradiction related constructs in the language of extended logic programs in order to gain explicit control of contradiction propagation. We nish by making comparisons and drawing some conclusions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Abductive Paraconsistent Semantics – MHP

In this paper we present a paraconsistent abdutive semantics for extended normal logic programs, the Paraconsistent Minimal Hypotheses semantics MHP . The MHP is a semantics of total paraconsistent models, that inherits the existence property of the abductive Minimal Hypotheses semantics MH [21], which is a semantics of total models, and the property of detection of support on contradiction of ...

متن کامل

The Abductive Paraconsistent Semantics MHp

In this paper we present a paraconsistent abdutive semantics for ELP , the paraconsistent minimal hypotheses semantics MHp. The MHp is a semantics of total paraconsistent models which combines the merits of two already existing semantics: it inherits the existence property of the abductive minimal hypotheses semantics MH, which is a semantics of total models, and the property of detection of su...

متن کامل

M ar 2 00 0 Automatic Belief Revision in SNePS ∗ CSE Technical Report 2000 - 01

SNePS is a logicand networkbased knowledge representation, reasoning, and acting system, based on a monotonic, paraconsistent, first-order term logic, with compositional intensional semantics. It has an ATMSstyle facility for belief contraction, and an acting component, including a well-defined syntax and semantics for primitive and composite acts, as well as for “rules” that allow for acting i...

متن کامل

Automatic Belief Revision in SNePS

SNePS is a logicand networkbased knowledge representation, reasoning, and acting system, based on a monotonic, paraconsistent, first-order term logic, with compositional intensional semantics. It has an ATMSstyle facility for belief contraction, and an acting component, including a well-defined syntax and semantics for primitive and composite acts, as well as for “rules” that allow for acting i...

متن کامل

J un 2 00 0 Automatic Belief Revision in SNePS ∗ CSE Technical Report 2000 - 01

SNePS is a logicand networkbased knowledge representation, reasoning, and acting system, based on a monotonic, paraconsistent, first-order term logic, with compositional intensional semantics. It has an ATMSstyle facility for belief contraction, and an acting component, including a well-defined syntax and semantics for primitive and composite acts, as well as for “rules” that allow for acting i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997